Toroidal embeddings of abstractly planar graphs are knotted or linked
نویسندگان
چکیده
We give explicit deformations of embeddings of abstractly planar graphs that lie on the standard torus T 2 ⊂ R3 and that contain neither a nontrivial knot nor a nonsplit link into the plane. It follows that ravels do not embed on the torus. Our results provide general insight into properties of molecules that are synthesized on a torus.
منابع مشابه
On Chirality of Toroidal Embeddings of Polyhedral Graphs
We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of torus knots and links [3],[4], we prove that nontrivial embeddings of simple 3connected planar graphs in the standard torus are chiral. For the case that th...
متن کاملAll toroidal embeddings of polyhedral graphs in 3-space are chiralw
The interplay between structural chemistry, graph theory and knot theory is a rich area for chemists and mathematicians alike. The founder of topology, Johann Listing, noted the possibility of chiral knots in 1847; a year later Pasteur published his landmark paper on the optical activity of ammonium tartrate crystals. Indeed, knot theory began following early studies on molecular isomerism. Mor...
متن کاملToroidal Embeddings of Right Groups
In this note we study embeddings of Cayley graphs of right groups on surfaces. We characterize those right groups which have a toroidal but no planar Cayley graph, such that the generating system of the right group has a minimal generating system of the group as a factor.
متن کاملAn Algorithm for Detecting Intrinsically Knotted Graphs
We describe an algorithm that recognizes seemingly most — possibly all — intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used in [6] to greatly expand the list of known minor minimal IK graphs, and to find knotless embeddings for some graphs that had previously resisted att...
متن کاملOn Embeddings of Circulant Graphs
A circulant of order n is a Cayley graph for the cyclic group Zn, and as such, admits a transitive action of Zn on its vertices. This paper concerns 2-cell embeddings of connected circulants on closed orientable surfaces. Embeddings on the sphere (the planar case) were classified by Heuberger (2003), and by a theorem of Thomassen (1991), there are only finitely many vertex-transitive graphs wit...
متن کامل